Location:
Search - LL Parser
Search list
Description: LL(1) parser , writen by C,include LLGenerator-LL (1) parser, written by C, include LLGenerator
Platform: |
Size: 25574 |
Author: 林祐安 |
Hits:
Description: 本程序要求用户在控制台里输入非终极符，终结符与产生式，然后对用户输入的文法进行分析，得出first集 与follow 集，并打印出预测分析表用户决定是否继续进行句型分析，如继续则给出符号分析栈的实现，从而判断刚输入的句子是否为符合该文法的句子。
该程序遵循LL（1） 文法FIRST（A）的构造：是A的所有可能推导的开头终结符或可能的ε FOLLOW（A）是所有句型中出现在紧接A之后的非终结符或“#” 预测分析程序 构造LL（1）分析表
ⅰ，构造文法中所有元素的FIRST和FOLLOW集合
ⅱ，对文法G的每个产生式A->α执行第三步和第四步
ⅲ，对每个终结符a∈FIRST（α）,把A->α加至M[A，a]
ⅳ，若ε∈FIRST（α），则对任何b∈FOLLOW(A)把A->α加至M[A，b]中
ⅴ，把所有无定义的M[A，a]标上“出错标志”
Platform: |
Size: 6681 |
Author: 刘志兵 |
Hits:
Description: Flex词法/语法分析器源码 -Flex syntactic and phrase parser code
Platform: |
Size: 384000 |
Author: 站长 |
Hits:
Description: Grammatica is a C# and Java parser generator (compiler compiler). It improves upon simlar tools (like yacc and ANTLR) by creating well-commented and readable source code, by having automatic error recovery and detailed error messages, and by support for testing and debugging grammars without generating source code. It supports LL(k) grammars with an unlimited number of look-ahead tokens.
Platform: |
Size: 632832 |
Author: none |
Hits:
Description: The Compiler Generator Coco/R
Coco/R1 is a compiler generator, which takes an attributed grammar of a source language
and generates a scanner and a parser for this language. The scanner works as a
deterministic finite automaton. The parser uses recursive descent. LL(1) conflicts can be
resolved by a multi-symbol lookahead or by semantic checks. Thus the class of accepted
grammars is LL(k) for an arbitrary k.
There are versions of Coco/R for Java, C#, C++, Delphi, Modula-2, Oberon and other
languages. This manual describes the versions for C# and Java implemented at the-The Compiler Generator Coco/RCoco/R1 is a compiler generator, which takes an attributed grammar of a source languageand generates a scanner and a parser for this language. The scanner works as adeterministic finite automaton. The parser uses recursive descent. LL (1) conflicts can beresolved by a multi-symbol lookahead or by semantic checks. Thus the class of acceptedgrammars is LL (k) for an arbitrary k.There are versions of Coco/R for Java, C#, C++, Delphi, Modula-2, Oberon and otherlanguages. This manual describes the versions for C# and Java implemented at the
Platform: |
Size: 41984 |
Author: yy |
Hits:
Description: LR1语法分析器
自动识别开始符号、终结符、非终结符；
生成各非终结符的 first和follow集
生成LR1分析表-Complete parser automatic identification symbols beginning and ending address, end-FU; The end-generating website and follow the first generation Complete Set Table Analysis
Platform: |
Size: 66560 |
Author: 余天 |
Hits:
Description: LL(1) parser , writen by C,include LLGenerator-LL (1) parser, written by C, include LLGenerator
Platform: |
Size: 25600 |
Author: 林祐安 |
Hits:
Description: LL（1）语法分析器，对任意输入LL(1)文法的分析表及字符串，
否为该文法的句子，并能给出分析过程。-LL (1) parser, the indiscriminate importation of LL (1) grammar analysis table and string, whether or not the sentence grammar, and can provide analysis process.
Platform: |
Size: 968704 |
Author: 飒飒 |
Hits:
Description: 了解语法分析器的内部工作原理，通过在本次实验中运用一定的编程技巧，掌握对表达式进行处理的一种方法。① 对输入文法，由程序自动构造FIRST FOLLOW集② 对输入文法，由程序自动生成它的LL(1)分析表；③ 对于给定的输入串，应能判断识别该串是否为给定文法的句型。-Understanding of the internal parser working principle, in this experiment through the use of a certain degree of programming skills, master of the expression of a way to deal with. ① the input grammar, automatically constructed by the procedures set FIRST FOLLOW ② the input grammar, it is automatically generated by the process of LL (1) analysis table ③ For a given input strings, should be able to identify the string to determine whether a given grammar sentence.
Platform: |
Size: 1031168 |
Author: vivian |
Hits:
Description: 学编译原理时写的一个语法分析程序
一．[目的要求]
① 对输入文法，由程序自动构造FIRST FOLLOW集
② 对输入文法，由程序自动生成它的LL(1)分析表；
③ 对于给定的输入串，应能判断识别该串是否为给定文法的句型。
二．[题目分析]
该程序可分为如下几步：
（1）读入文法
（2）判断正误
（3）若无误，判断是否为LL(1)文法
（4）若是，构造分析表；
（5）由总控算法判断输入符号串是否为该文法的句型。
-Studies Compilation Principle of a time to write a parser. [Objective request] ① the input grammar, automatically constructed by the procedures set FIRST FOLLOW ② the input grammar, it is automatically generated by the process of LL (1) analysis table ③ For a given input strings, should be able to identify the string to determine whether given the sentence grammar.二. [Title Analysis] The program can be divided into the following steps: (1) read into the grammar (2) The judge is false (3) If correct, determine whether to LL (1) grammar (4) If so, structural analysis table (5) controlled by the general algorithm to determine whether the string of input symbols for the grammar of the sentence.
Platform: |
Size: 5120 |
Author: 李爱春 |
Hits:
Description: ll(1)语法分析器 编译原理实验课 必须的实验-ll (1) parser class must be compiled experiment experiment
Platform: |
Size: 3072 |
Author: 傅波 |
Hits:
Description: 本程序要求用户在控制台里输入非终极符，终结符与产生式，然后对用户输入的文法进行分析，得出first集 与follow 集，并打印出预测分析表用户决定是否继续进行句型分析，如继续则给出符号分析栈的实现，从而判断刚输入的句子是否为符合该文法的句子。
该程序遵循LL（1） 文法FIRST（A）的构造：是A的所有可能推导的开头终结符或可能的ε FOLLOW（A）是所有句型中出现在紧接A之后的非终结符或“#” 预测分析程序 构造LL（1）分析表
ⅰ，构造文法中所有元素的FIRST和FOLLOW集合
ⅱ，对文法G的每个产生式A->α执行第三步和第四步
ⅲ，对每个终结符a∈FIRST（α）,把A->α加至M[A，a]
ⅳ，若ε∈FIRST（α），则对任何b∈FOLLOW(A)把A->α加至M[A，b]中
ⅴ，把所有无定义的M[A，a]标上“出错标志”
-err
Platform: |
Size: 6144 |
Author: 刘志兵 |
Hits:
Description: 这是一个完整的文法分析器，能识别FIRST、FOLLOW集，还有实验报告！-This is a complete grammar parser, to identify FIRST, FOLLOW sets, there are experimental reports!
Platform: |
Size: 230400 |
Author: yangshuangxue |
Hits:
Description: 一个LL1分析器,可以输入产生式的条数,以及产生式,开始符号 结束符号 可以输出堆栈的运行情况-A LL1 parser, you can enter the production number of the article, as well as the production start symbol symbol can be the end of the operation of the output stack
Platform: |
Size: 986112 |
Author: 刘以风 |
Hits:
Description: 编译原理课上的一个LL(1)语法分析器的实现-Compilation Principle of a class of LL (1) the realization of parser
Platform: |
Size: 59392 |
Author: Charles |
Hits:
Description: 一个简单的LL(1)带预测的语法分析器源代码-A simple LL (1) with a predictable source code parser
Platform: |
Size: 2048 |
Author: 王天放 |
Hits:
Description: LL（1）语法分析器设计
1．如下为给定的LL（1）文法。
G[<P>]：
1) <P>->program <D> : <T> begin <S> end {program}
2) D->i D’ {i}
3) D’->, i D’ {,}
4) D’->ε {:}
5) S->s S’ {s}
6) S’-> s S’ { }
7) S’->ε {end}
8) T->real {real}
9) T->integer {integer}
其中右侧{}内为产生的可选集。
2．调试并完善如下给出的文法的LL（1）分析器示例程序，并设输入的文法的句子为：
program
i , i , i : integer
begin
s s s
end
给出输出结果并进行分析说明。
-1. Below for a given LL (1) grammar.
G [<P>]:
1) <P>-> program <D>: <T> begin <S> end {program}
2) D-> i D {i}
3) D ->, i D {,}
4) D -> ε {:}
5) S-> s S {s}
6) S -> s S { }
7) S -> ε {end}
8) T-> real {real}
9) T-> integer {integer}
{} within which the right to produce an optional set.
2. Debug and improve the grammar given in the following LL (1) analyzer sample program, and set the input sentence is the grammar:
program
i, i, i: integer
begin
s s s
end
Output and analysis are given instructions.
Platform: |
Size: 190464 |
Author: 浮云 |
Hits:
Description: 实现LL（1）文法，能对其实现自顶向下的语法分析并预测分析方法。-Achieve LL (1) grammar, to achieve its top-down method of syntax analysis and predictive analysis.
Platform: |
Size: 6144 |
Author: caoqingzhu |
Hits:
Description: An LL parser is a top-down parser for a subset of the context-free grammars.
Platform: |
Size: 2523136 |
Author: Malefic |
Hits:
Description: An LL parser is a top-down parser for a subset of the context-free grammars.
Platform: |
Size: 1024 |
Author: Malefic |
Hits: